Function approximation via the subsampled Poincaré inequality

نویسندگان

چکیده

Function approximation and recovery via some sampled data have long been studied in a wide array of applied mathematics statistics fields. Analytic tools, such as the Poincaré inequality, handy for estimating errors different scales. The purpose this paper is to study generalized where measurement function subsampled type, with small but non-zero lengthscale that will be made precise. Our analysis identifies inequality basic tool problems. We discuss demonstrate optimality concerning lengthscale, connecting it existing results literature. In application problems, accuracy using basis functions under regularity assumptions established by inequality. observe error bound blows up approaches zero, due fact underlying not regular enough well-defined pointwise values. A weighted version proposed address problem; its also discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Cluster Approximation via Inequality

Given an example-feature set, representing the information context present in a dataset, is it possible to reconstruct the information context in the form of clusters to a certain degree of compromise, if the examples are processed randomly without repetition in a sequential online manner? A general transductive inductive learning strategy which uses constraint based multivariate Chebyshev ineq...

متن کامل

Approximation for the gamma function via the tri-gamma function

In this paper, we present a new sharp approximation for the gamma function via the tri-gamma function. This approximation is fast in comparison with the recently discovered asymptotic series. We also establish the inequalities related to this approximation. Finally, some numerical computations are provided for demonstrating the superiority of our approximation.

متن کامل

Minimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs

This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with reje...

متن کامل

Transductive-Inductive Cluster Approximation Via Multivariate Chebyshev Inequality

Approximating adequate number of clusters in multidimensional data is an open area of research, given a level of compromise made on the quality of acceptable results. The manuscript addresses the issue by formulating a transductive inductive learning algorithm which uses multivariate Chebyshev inequality. Considering clustering problem in imaging, theoretical proofs for a particular level of co...

متن کامل

Improved matrix algorithms via the Subsampled Randomized Hadamard Transform

Several recent randomized linear algebra algorithms rely upon fast dimension reduction methods. A popular choice is the Subsampled Randomized Hadamard Transform (SRHT). In this article, we address the efficacy, in the Frobenius and spectral norms, of an SRHT-based low-rank matrix approximation technique introduced by Woolfe, Liberty, Rohklin, and Tygert. We establish a slightly better Frobenius...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete and Continuous Dynamical Systems

سال: 2021

ISSN: ['1553-5231', '1078-0947']

DOI: https://doi.org/10.3934/dcds.2020296